| Name | Version | Summary | date |
|---|---|---|---|
| tinytrie | 0.1.0a5 | A minimal type-safe trie (prefix tree) implementation in Python. | 2025-07-23 15:22:59 |
| affix-tree | 0.1.1 | A trie-like data structure that allows storing and searching data based on the longest matching prefix or suffix of a given string. | 2025-02-15 09:15:09 |
| triematch | 0.0.1rc0 | Fast lookup for string patterns using Trie, Radix & Aho-Corasick algorithms | 2025-01-08 14:34:31 |
| hour | day | week | total |
|---|---|---|---|
| 40 | 1961 | 10383 | 305593 |